m at h . FA ] 1 1 M ar 2 00 5 FRAMES , GRAPHS AND ERASURES BERNHARD

Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number of the frame coefficients of a vector are lost. We derive general error bounds for two-uniform frames when more than two erasures occur and apply these to concrete examples. We show that among the 227 known equivalence classes of two-uniform (36,15)-frames arising from Hadamard matrices, there are 5 that give smallest error bounds for up to 8 erasures.